Проблема: стандартные массивы для очереди могут привести к необходимости дорогостоящих операций сдвига элементов при удалении.
Решение: в книге Algorithms and Data Structures for OOP With C# автор предлагает реализовать очередь на основе связного списка, что позволяет эффективно добавлять элементы в конец и удалять с начала за O(1).
Пример кода:
public class Node<T> { public T Data; public Node<T> Next;
public Node(T data) { Data = data; Next = null; } }
public class QueueLinkedList<T> { private Node<T> front, rear;
public QueueLinkedList() { front = rear = null; }
public void Enqueue(T item) { var newNode = new Node<T>(item); if (rear == null) { front = rear = newNode; return; } rear.Next = newNode; rear = newNode; }
public T Dequeue() { if (front == null) throw new InvalidOperationException("Queue is empty.");
var data = front.Data; front = front.Next;
if (front == null) rear = null;
return data; } }
Преимущества: — Нет затрат на сдвиг элементов — Высокая производительность при операциях добавления и удаления — Универсальная реализация для любых типов данных
Проблема: стандартные массивы для очереди могут привести к необходимости дорогостоящих операций сдвига элементов при удалении.
Решение: в книге Algorithms and Data Structures for OOP With C# автор предлагает реализовать очередь на основе связного списка, что позволяет эффективно добавлять элементы в конец и удалять с начала за O(1).
Пример кода:
public class Node<T> { public T Data; public Node<T> Next;
public Node(T data) { Data = data; Next = null; } }
public class QueueLinkedList<T> { private Node<T> front, rear;
public QueueLinkedList() { front = rear = null; }
public void Enqueue(T item) { var newNode = new Node<T>(item); if (rear == null) { front = rear = newNode; return; } rear.Next = newNode; rear = newNode; }
public T Dequeue() { if (front == null) throw new InvalidOperationException("Queue is empty.");
var data = front.Data; front = front.Next;
if (front == null) rear = null;
return data; } }
Преимущества: — Нет затрат на сдвиг элементов — Высокая производительность при операциях добавления и удаления — Универсальная реализация для любых типов данных
At a time when the Indian stock market is peaking and has rallied immensely compared to global markets, there are companies that have not performed in the last 10 years. These are definitely a minor portion of the market considering there are hundreds of stocks that have turned multibagger since 2020. What went wrong with these stocks? Reasons vary from corporate governance, sectoral weakness, company specific and so on. But the more important question is, are these stocks worth buying?
Telegram auto-delete message, expiring invites, and more
elegram is updating its messaging app with options for auto-deleting messages, expiring invite links, and new unlimited groups, the company shared in a blog post. Much like Signal, Telegram received a burst of new users in the confusion over WhatsApp’s privacy policy and now the company is adopting features that were already part of its competitors’ apps, features which offer more security and privacy. Auto-deleting messages were already possible in Telegram’s encrypted Secret Chats, but this new update for iOS and Android adds the option to make messages disappear in any kind of chat. Auto-delete can be enabled inside of chats, and set to delete either 24 hours or seven days after messages are sent. Auto-delete won’t remove every message though; if a message was sent before the feature was turned on, it’ll stick around. Telegram’s competitors have had similar features: WhatsApp introduced a feature in 2020 and Signal has had disappearing messages since at least 2016.
